Constructions of Self-Dual and Formally Self-Dual Codes from Group Rings
نویسندگان
چکیده
We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in [11] by showing that one of the conditions given in the theorem is unnecessary and moreover it restricts the number of self-dual codes obtained by the construction. We show that several of the standard constructions of self-dual codes are found within our general framework. We prove that our constructed codes correspond to ideals in the group ring RG and as such must have an automorphism group that contains G as a subgroup. We also prove that a common construction technique for producing self-dual codes cannot produce the putative [72, 36, 16] Type II code. Additionally, we show precisely which groups can be used to construct the extremal Type II codes over length 24 and 48.
منابع مشابه
Linear codes over Z4+uZ4: MacWilliams identities, projections, and formally self-dual codes
Linear codes are considered over the ring Z 4 + uZ 4 , a non-chain extension of Z 4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumer-ators are proved. Two projections from Z 4 + uZ 4 to the rings Z 4 and F 2 + uF 2 are considered and self-dual codes over Z 4 +uZ 4 are studied in connection with these projections. ...
متن کاملZ 2 Z 4 - Additive Formally Self - Dual Codes
We study odd and even Z2Z4 formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.
متن کاملConstructions of self-dual codes over finite commutative chain rings
We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction to self-dual codes over principal ideal rings via the Chinese Remainder Theorem. We use torsion codes to describe the...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملFormally self-dual codes and Gray maps
In this paper we investigate binary formally self-dual codes as images of codes over rings using various Gray maps.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1604.07863 شماره
صفحات -
تاریخ انتشار 2016